Constructing weakly connected dominating set for secure clustering in distributed sensor network
نویسندگان
چکیده
Secure clustering problem plays an important role in distributed sensor networks. Weakly Connected Dominating Set (WCDS) is used for solving this problem. Therefore, computing a minimum WCDS becomes an important topic of this research. In this paper, we compare the size of Maximal Independent Set (MIS) and minimum WCDS in unit disk graph. Our analysis shows that five is the least upper bound for this ratio. We also present a distributed algorithm to produce a weakly connected MIS within a factor 5 from the minimum WCDS.
منابع مشابه
Weakly connected dominating set-based secure clustering and operation in distributed sensor networks
This paper presents an efficient approach to secure network formation in distributed sensor networks (DSNs), which could be used for secure communications among the nodes after the start of the network’s operation. The structure of the network is formed on the basis of offline rank assignments by pre-distribution of secret keys to the participating sensors. Our approach uses the notion of weakl...
متن کاملA Zonal Algorithm for Clustering An Hoc Networks
A Mobile Ad Hoc Network (MANET) is an infrastructureless wireless network that can support highly dynamic mobile units. The multi-hop feature of a MANET suggests the use of clustering to simplify routing. Graph domination can be used in defining clusters in MANETs. A variant of dominating set which is more suitable for clustering MANETs is the weakly-connected dominating set. A cluster is defin...
متن کاملMaintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been proposed to form clusters is to use weaklyconnected dominating sets [Y.P. Chen, A.L. Liestman, App...
متن کاملEfficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is more suitable for cluster formation is the weakly-connected dominating set (WCDS). We propose an area based distributed algorithm for WCDS formation with time and message complexity O(n). In this Area algorithm, we part...
متن کاملKNOM Conference 논문제출 양식 A Group-based Network Architecture to Defend Node Capture Attacks in Wireless Sensor Networks
This paper presents a group-based security scheme for distributed wireless sensor networks. The scheme is devised for dealing with sensory data aggregated by groups of collocated sensors. We model the network for secure routing with 3-tier sensor network composing three types of nodes: Base station, group dominator and ordinary sensor nodes. It is shown that more than 85% network connectivity c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 23 شماره
صفحات -
تاریخ انتشار 2012